feasible solution

Terms from Artificial Intelligence: humans at the heart of algorithms

Page numbers are for draft copy at present; they will be replaced with correct numbers when final book is formatted. Chapter numbers are correct and will not change now.

A solution is feasible if it satsfies all constraints, that is it is in some way valid. This is contrast to an optimal solution which maximises some objective function. In some applications, such as pure {[constraint satisfaction}}, it is sufficient to find any feasible solution, in others the optimal solution within the set of feasible solutions is required.

Defined on pages 56, 190

Used on Chap. 4: pages 56, 75; Chap. 9: pages 190, 191, 192

Also known as feasibility, feasible